Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Matrice éparse")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 282

  • Page / 12
Export

Selection :

  • and

A stable and sparsity exploiting LU factorization of the basis matrix in linear programmingTOLLA, P.European journal of operational research. 1986, Vol 24, Num 2, pp 247-251, issn 0377-2217Article

Überlegungen zu Rechenzeit und Speicherplatz fur spärlich besetzte Matrizen und Systemzerlegungen in Macros. II = Considérations sur le temps de calcul et l'espace mémoire des matrices éparses et du déchirement de système dans les macrosSPIRO, H.Elektronische Rechenanlagen. 1983, Vol 25, Num 4, pp 178-188, issn 0013-5720Article

Sparse matrix methods for equation-based chemical process flowshetting. IISTADTHERR, M. A; WOOD, E. S.Computers & chemical engineering. 1984, Vol 8, Num 1, pp 19-33, issn 0098-1354Article

Software for estimating sparse Hessian matricesCOLEMAN, T. F; GARBOW, B. S; MORE, J. J et al.ACM transactions on mathematical software. 1985, Vol 11, Num 4, pp 363-377, issn 0098-3500Article

A note on Boolean matrix multiplicationVYSKOC, J.Information processing letters. 1984, Vol 19, Num 5, pp 249-251, issn 0020-0190Article

Exploiting the sparsity in the solution of linear ordinary differential equationsZLATEV, Z; WASNIEWSKI, J; SCHAUMBURG, K et al.Computers & mathematics with applications. 1985, Vol 11, Num 11, pp 1069-1087, issn 0097-4943Article

Orthogonal reduction of sparse matrices to upper triangular form using householder transformationsGEORGE, A; NG, E.SIAM journal on scientific and statistical computing. 1986, Vol 7, Num 2, pp 460-472, issn 0196-5204Article

Sparse matrix methods for equation-based chemical process flowsheeting. ISTADTHERR, M. A; WOOD, E. S.Computers & chemical engineering. 1984, Vol 8, Num 1, pp 9-18, issn 0098-1354Article

Überlegungen zu Rechenzeit und Speicherplatz für spärlich besetzte Matrizen und Systemzerlegungen in Macras = Considération sur le temps de calcul et l'espace de stockage des matrices éparses et du système de déchirement dans les macros = Considerations about computing time and storage space for sparse matrices and system tearing into macrosSPIRO, H.Elektronische Rechenanlagen. 1983, Vol 25, Num 3, pp 117-123, issn 0013-5720Article

Reordering a sparse matrix to a sparse blocked formALTURAIGI, M. A; BICKART, T. A.International journal of circuit theory and applications. 1985, Vol 13, Num 2, pp 173-178, issn 0098-9886Article

Evaluation of orderings for unsymmetric sparse matricesERISMAN, A. M; GRIMES, R. G; LEWIS, J. G et al.SIAM journal on scientific and statistical computing. 1987, Vol 8, Num 4, pp 600-624, issn 0196-5204Article

Program F. Matinv for the solution of the sparse linear system An=bZISSERMAN, A; CALDWELL, J.Advances in engineering software (1978). 1984, Vol 6, Num 1, pp 2-8, issn 0141-1195Article

A letter-oriented perfect hashing scheme based upon sparse table compressionCHIN-CHEN CHANG; TZONG-CHEN WU.Software, practice & experience. 1991, Vol 21, Num 1, pp 35-49, issn 0038-0644, 15 p.Article

SOLUTION DES SYSTEMES D'EQUATIONS LINEAIRES A MATRICE EPARSEVILENKIN S YA; DUBENKO TI; LAPING KA et al.1983; GEODEZIJA I KARTOGRAFIJA; ISSN 0016-7126; SUN; DA. 1983; NO 1; PP. 36-39; BIBL. 5 REF.Article

THE BORDERED TRIANGULAR MATRIX AND MINIMUM ESSENTIAL SETS OF A DIGRAPH.CHEUNG LK; KUH ES.1974; I.E.E.E TRANS. CIRCUITS SYST.; U.S.A.; DA. 1974; VOL. 21; NO 5; PP. 633-639; BIBL. 17 REF.Article

Efficient parallel processing technique for inverting matrices with random sparsityBETANCOURT, R.IEE proceedings. Part E. Computers and digital techniques. 1986, Vol 133E, Num 4, pp 235-240, issn 0143-7062Article

New re-ordering algorithm for skyline methodTANIGUCHI, T; SOGA, A.Engineering computations. 1985, Vol 2, Num 2, pp 107-113, issn 0264-4401Article

Sensitivity calculations using the component connection modelDECARLO, R.International journal of circuit theory and applications. 1984, Vol 12, Num 3, pp 288-291, issn 0098-9886Article

Sparse systems. Digraph exact disturbance rejectionANDREI, N.Revue roumaine des sciences techniques. Electrotechnique et énergétique. 1983, Vol 28, Num 4, pp 405-413, issn 0035-4066Article

Column relaxation methods for least norm problemsDAX, A; BERKOWITZ, B.SIAM journal on scientific and statistical computing. 1990, Vol 11, Num 5, pp 975-989, issn 0196-5204Article

A reanalysis of jaw joint data using incomplete multidimensional contingency tablesUPTON, G. J. G.Biometrical journal. 1985, Vol 27, Num 5, pp 533-540, issn 0323-3847Article

Estimation of sparse Hessian matrices and graph colouring problemsCOLEMAN, R; MORE, J. J.Mathematical programming. 1984, Vol 28, Num 3, pp 243-270, issn 0025-5610Article

Orthogonalisation for power-system computationsWALLACH, Y.Archiv für Elektrotechnik (Berlin). 1984, Vol 67, Num 1, pp 57-64, issn 0003-9039Article

Relaxation-based electrical simulationNEWTON, A. R; SANGIOVANNI-VINCENTELLI, A. L.IEEE transactions on computer-aided design of integrated circuits and systems. 1984, Vol 3, Num 4, pp 308-331, issn 0278-0070Article

SPARSITY CONSIDERATIONS IN NETWORK SOLUTION BY TEARINGHAJJ IN.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 5; PP. 357-366; BIBL. 24 REF.Article

  • Page / 12